Multi-objective Trajectory Planning Method based on the Improved Elitist Non-dominated Sorting Genetic Algorithm
نویسندگان
چکیده
Abstract Robot manipulators perform a point-point task under kinematic and dynamic constraints. Due to multi-degree-of-freedom coupling characteristics, it is difficult find better desired trajectory. In this paper, multi-objective trajectory planning approach based on an improved elitist non-dominated sorting genetic algorithm (INSGA-II) proposed. Trajectory function planned with new composite polynomial that by combining of quintic polynomials cubic Bezier curves. Then, INSGA-II, introducing three operators: ranking group selection (RGS), direction-based crossover (DBX) adaptive precision-controllable mutation (APCM), developed optimize travelling time torque fluctuation. Inverted generational distance, hypervolume optimizer overhead are selected evaluate the convergence, diversity computational effort algorithms. The optimal solution determined via fuzzy comprehensive evaluation obtain Taking serial-parallel hybrid manipulator as instance, velocity acceleration profiles obtained using compared those B-spline method. effectiveness practicability proposed method verified simulation results. This research proposes optimization which can offer efficiency stability for point-to-point robot manipulators.
منابع مشابه
Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms
A multi-objective vehicle path planning method has been proposed to optimize path length, path safety and path smoothness using the elitist non-dominated sorting genetic algorithm (NSGA-II). Four different path representation schemes that begin its coding from the start point and move one grid at a time towards the destination point are proposed. Minimization of traveled distance, maximization ...
متن کاملA Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II
Abstract. Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algor...
متن کاملA Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II
Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algo...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملA method for identifying software components based on Non-dominated Sorting Genetic Algorithm
Identifying the appropriate software components in the software design phase is a vital task in the field of software engineering and is considered as an important way to increase the software maintenance capability. Nowadays, many methods for identifying components such as graph partitioning and clustering are presented, but most of these methods are based on expert opinion and have poor accur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese journal of mechanical engineering
سال: 2022
ISSN: ['1000-9345', '2192-8258']
DOI: https://doi.org/10.1186/s10033-021-00669-x